#10.6测试basicpathset函数
import _00GraphFuc as gf

m,n=10,10
[V,E]=gf.creategraph(m,n)
k=4
E=sorted(E)
e=E[0]
path0={e}

for k in range(m):
    path = gf.basicpathset(path0,E)
    if path == set({}):
        break
    path0=path
gf.drawgraph(E)
print("V,E",V,E)
print("e,len(path0),path0",e,len(path0),path0)
print("path",path)